Compact Routing Schemes for Dynamic Ring Networks

Improved Compact Routing Schemes for Power-Law Networks

Compact routing intends to achieve good tradeoff between the routing path length and the memory overhead, and is recently considered as a main alternative to overcome the fundamental scaling problems of the Internet routing system. Plenty of studies have been conducted on compact routing, and quite a few universal compact routing schemes have been designed for arbitrary network topologies. Howe...

Prefix Routing Schemes in Dynamic Networks

Compact Routing Schemes for Generalised Chordal Graphs

In this paper, we show how to use the notion of layering-tree introduced in [5], in order to obtain polynomial time constructible routing schemes. We describe efficient routing schemes for two classes of graphs that include the class of chordal graphs. For k-chordal graphs, i.e., graphs containing no induced cycle of length greater than k, the routing scheme uses addresses and local memories of...

Compact Routing Schemes in Networks of Low Doubling Dimension

We consider compact routing schemes in networks of low doubling dimension, where the doubling dimension is the least value α such that any ball in the network can be covered by at most 2 balls of half radius. There are two variants of routing scheme design: (i) labeled (name-dependent) routing, where the designer is allowed to rename the nodes so that the names (labels) can contain additional r...

Compact Routing for Flat Networks

In [4], Cowen presented a universal compact routing algorithm with a stretch factor of three and a table-size of O(n2/3 log4/3 n), based on a simple and practical model. (The table-size is later improved to O( √ n log3 n) [20].) This stretch factor of three matches a general lower bound given in [9] and also matches a much tighter lower bound if we restrict the model to the Cowen’s [12]. Thus i...